On the nullity of connected graphs with least eigenvalue at least -2
نویسندگان
چکیده
منابع مشابه
Notes on graphs with least eigenvalue at least -2
A new proof concerning the determinant of the adjacency matrix of the line graph of a tree is presented and an invariant for line graphs, introduced by Cvetković and Lepović, with least eigenvalue at least −2 is revisited and given a new equivalent definition [D. Cvetković and M. Lepović. Cospectral graphs with least eigenvalue at least −2. Publ. Inst. Math., Nouv. Sér., 78(92):51–63, 2005.]. E...
متن کاملEla Notes on Graphs with Least Eigenvalue
A new proof concerning the determinant of the adjacency matrix of the line graph of a tree is presented and an invariant for line graphs, introduced by Cvetković and Lepović, with least eigenvalue at least −2 is revisited and given a new equivalent definition [D. Cvetković and M. Lepović. Cospectral graphs with least eigenvalue at least −2. Publ. Inst. Math., Nouv. Sér., 78(92):51–63, 2005.]. E...
متن کاملOn distance-regular graphs with smallest eigenvalue at least -m
A non-complete geometric distance-regular graph is the point graph of a partial geometry in which the set of lines is a set of Delsarte cliques. In this paper, we prove that for fixed integer m ≥ 2, there are only finitely many non-geometric distance-regular graphs with smallest eigenvalue at least −m, diameter at least three and intersection number c2 ≥ 2.
متن کاملThe Least Eigenvalue of Graphs
In this paper we investigate the least eigenvalue of a graph whose complement is connected, and present a lower bound for the least eigenvalue of such graph. We also characterize the unique graph whose least eigenvalue attains the second minimum among all graphs of fixed order.
متن کاملOn the Least Eigenvalue of Graphs with Cut Vertices
Let S be a certain set of graphs. A graph is called a minimizing graph in the set S if its least eigenvalue attains the minimum among all graphs in S . In this paper, we determine the unique minimizing graph in Gn, where Gn denotes the set of connected graphs of order n with cut vertices.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applicable Analysis and Discrete Mathematics
سال: 2013
ISSN: 1452-8630,2406-100X
DOI: 10.2298/aadm130710014z